Boolean Matrices . . . Neither Boolean nor Matrices
نویسندگان
چکیده
Boolean matrices, the incidence matrices of a graph, are known not to be the (universal) matrices of a Boolean algebra. Here, we also show that their usual composition cannot make them the matrices of any algebra. Yet, later on, we “show” that it can. This seeming paradox comes from the hidden intrusion of a widespread set-theoretical (mis) definition and notation and denies its harmlessness. A minor modification of this standard definition might fix it.
منابع مشابه
Power Indices of Trace Zero Symmetric Boolean Matrices
The power index of a square Boolean matrix A is the least integer d such that A is a linear combination of previous nonnegative powers of A. We determine the maximum power indices for the class of n × n primitive symmetric Boolean matrices of trace zero, the class of n × n irreducible nonprimitive symmetric Boolean matrices, and the class of n×n reducible symmetric Boolean matrices of trace zer...
متن کاملCharacteristic matrix of covering and its application to Boolean matrix decomposition
Covering-based rough sets provide an efficient theory to deal with covering data which widely exist in practical applications. Boolean matrix decomposition has been widely applied to data mining and machine learning. In this paper, three types of existing covering approximation operators are represented by boolean matrices, and then they are used to decompose into boolean matrices. First, we de...
متن کاملThe Composition, Convergence and Transitivity of Powers and Adjoint of Generalized Fuzzy Matrices
Path algebras are additively idempotent semirings and generalize Boolean algebras, fuzzy algebras, distributive lattices and inclines. Thus the Boolean matrices, the fuzzy matrices, the lattice matrices and the incline matrices are prototypical examples of matrices over path algebras. In this paper, generalized fuzzy matrices are considered as matrices over path algebras. Compositions of genera...
متن کاملThe Complexity of Boolean Matrix Root Computation
We show that finding roots of Boolean matrices is an NPhard problem. This answers a twenty year old question from semigroup theory. Interpreting Boolean matrices as directed graphs, we further reveal a connection between Boolean matrix roots and graph isomorphism, which leads to a proof that for a certain subclass of Boolean matrices related to subdivision digraphs, root finding is of the same ...
متن کاملFast algorithms for anti-distance matrices as a generalization of Boolean matrices
We show that Boolean matrix multiplication, computed as a sum of products of column vectors with row vectors, is essentially the same as Warshall’s algorithm for computing the transitive closure matrix of a graph from its adjacency matrix. Warshall’s algorithm can be generalized to Floyd’s algorithm for computing the distance matrix of a graph with weighted edges. We will generalize Boolean mat...
متن کامل